Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
نویسنده
چکیده
The crossed cube, which is a variation of the hypercube, possesses some properties superior to the hypercube. In this paper, assuming that each node is incident with at least two fault-free links, we show that an n-dimensional crossed cube contains a fault-free Hamiltonian cycle, even if there are up to 2n 5 link faults. The result is optimal with respect to the number of link faults tolerated. We also verify that the assumption is practically meaningful by evaluating its occurrence probability, which is very close to 1. 2007 Elsevier Inc. All rights reserved.
منابع مشابه
Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
The locally twisted cube is a variation of hypercube, which possesses some properties superior to the hypercube. In this paper, we investigate the edge-faulttolerant hamiltonicity of an n-dimensional locally twisted cube, denoted by LTQn. We show that for any LTQn (n ≥ 3) with at most 2n− 5 faulty edges in which each node is incident to at least two fault-free edges, there exists a fault-free H...
متن کاملFault-free Hamiltonian Cycles in Alternating Group Graphs with Conditional Edge Faults
The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...
متن کاملThe property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
The presence of edge-disjoint Hamiltonian cycles provides an advantage when implementing algorithms that require a ring structure by allowing message traffic to be spread evenly across the network. Edge-disjoint Hamiltonian cycles also provide the edge-fault tolerant hamiltonicity of an interconnection network. In this paper, we first study the property of edge-disjoint Hamiltonian cycles in tr...
متن کاملWirelength of 1-fault hamiltonian graphs into wheels and fans
In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...
متن کاملFault-free longest paths in star networks with conditional link faults
The star network, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each node is assumed to be incident with two ormore fault-free links, we show that an n-dimensional star network can tolerate up to 2n− 7 link faults, and be strongly (fault-free)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 407 شماره
صفحات -
تاریخ انتشار 2007